Tag: binary-tree

295 Difference between binary tree and binary search tree 2011-06-17T00:42:38.430

261 What are the applications of binary trees? 2010-01-25T05:40:36.270

184 Skip List vs. Binary Search Tree 2008-11-02T04:39:55.603

176 How to find the lowest common ancestor of two nodes in any binary tree? 2009-09-27T21:01:41.943

134 How to print binary tree diagram? 2011-02-11T03:28:33.277

125 Heap vs Binary Search Tree (BST) 2011-05-27T02:30:45.483

109 How to determine if binary tree is balanced? 2009-04-13T01:58:06.673

105 Are duplicate keys allowed in the definition of binary search trees? 2008-11-19T03:45:21.520

103 Find kth smallest element in a binary search tree in Optimum way 2010-02-24T20:18:05.183

84 Explain Morris inorder tree traversal without using stacks or recursion 2011-03-31T16:11:16.857

78 How to Implement a Binary Tree? 2010-04-08T08:23:42.707

72 Binary Trees vs. Linked Lists vs. Hash Tables 2008-12-16T12:20:17.587

72 Is Big O(logn) log base e? 2009-10-15T00:28:53.797

64 C How to "draw" a Binary Tree to the console 2009-04-29T10:19:32.357

64 With ' N ' no of nodes, how many different Binary and Binary Search Trees possible? 2010-06-15T03:51:08.277

62 When to use Preorder, Postorder, and Inorder Binary Search Tree Traversal strategies 2012-02-26T20:40:17.070

61 B-tree faster than AVL or RedBlack-Tree? 2009-03-15T09:20:36.550

59 Difference between "Complete binary tree", "strict binary tree","full binary Tree"? 2012-09-10T21:20:47.223

57 The best way to calculate the height in a binary search tree? (balancing an AVL-tree) 2009-02-22T20:59:44.630

53 Red-Black Trees 2008-08-21T18:37:15.620

53 Is there a built-in Binary Search Tree in .NET 4.0? 2010-07-16T07:57:39.703

50 Post order traversal of binary tree without recursion 2009-08-18T15:37:14.913

50 Check if a binary tree is a mirror image or symmetric 2011-12-08T19:38:16.353

47 Finding height in Binary Search Tree 2010-04-08T04:47:36.590

45 Write a non-recursive traversal of a Binary Search Tree using constant space and O(n) run time 2011-03-31T07:19:40.197

40 What is the fastest way to change a key of an element inside std::map 2011-04-21T11:38:43.627

39 Why use binary search if there's ternary search? 2010-08-17T00:09:36.700

34 What is an "internal node" in a binary search tree? 2008-11-05T16:46:49.177

32 Finding if a Binary Tree is a Binary Search Tree 2012-05-31T11:13:54.990

31 Reverse A Binary Tree (Left to Right) 2012-02-27T05:01:53.107

30 Tail recursive function to find depth of a tree in Ocaml 2012-02-17T04:46:26.823

29 Printing BFS (Binary Tree) in Level Order with _specific formatting_ 2009-12-12T22:04:00.337

28 check if a tree is a binary search tree 2011-01-01T19:34:01.100

27 C++ STL: Binary Search Tree Implementation? 2011-02-22T23:00:53.250

26 Expression Evaluation and Tree Walking using polymorphism? (ala Steve Yegge) 2008-08-15T17:31:39.427

25 How to Serialize Binary Tree 2011-01-06T03:48:45.703

25 B trees vs binary trees 2011-06-02T06:14:48.397

24 Are AVL Trees Evil? 2009-09-08T15:31:36.257

24 Efficient Array Storage for Binary Tree 2010-04-20T14:07:47.937

24 Height of a tree with only one node 2010-10-31T22:19:00.823

24 Algorithm to print all paths with a given sum in a binary tree 2012-07-04T11:37:54.140

22 What data structure using O(n) storage with O(log n) query time should I use for Range Minimum Queries? 2010-02-23T00:41:24.970

22 binary search vs binary search tree 2011-05-11T18:34:53.580

22 In-order iterator for binary tree 2012-10-12T01:11:03.460

21 In-order tree traversal 2009-01-28T00:56:27.260

21 Efficient algorithm to determine if an alleged binary tree contains a cycle? 2011-08-21T18:31:58.320

21 Algorithm to produce a difference of two collections of intervals 2012-08-09T20:03:26.653

20 The possible number of binary search trees that can be created with N keys is given by the Nth catalan number. Why? 2009-08-30T01:07:42.093

20 Determine if two binary trees are equal 2009-09-27T05:00:59.493

20 Objects that represent trees 2009-11-27T02:35:31.977

20 balancing an AVL tree (C++) 2010-11-18T21:25:48.733

20 Merging 2 Binary Search Trees 2011-09-24T17:11:08.277

18 Skip Lists -- ever used them? 2008-10-24T17:41:00.817

18 Convert a binary tree to linked list, breadth first, constant storage/destructive 2010-08-05T04:40:07.283

18 Find paths in a binary search tree summing to a target value 2011-01-04T08:30:30.103

18 how to get the path from root to a given node on a binary tree? 2011-09-09T00:26:43.270

18 Is Pre-Order traversal on a binary tree same as Depth First Search? 2014-02-05T08:08:29.190

18 Node search in Binary Tree overflows stack 2017-03-28T09:06:33.510

17 What does it mean for two binary trees to be isomorphic? 2009-04-12T23:10:01.910

17 Iterating over a Binary Tree with O(1) Auxiliary Space 2009-04-26T15:28:30.750

17 How would you print out the data in a binary tree, level by level, starting at the top? 2009-07-09T15:29:23.670

17 Convert a maximum heap to a binary search tree 2011-02-11T05:48:20.500

17 GraphViz binary tree left and right child 2012-02-09T17:33:44.040

17 The most efficient way to test two binary trees for equality 2012-03-07T07:09:42.500

17 What is the left-child, right-sibling representation of a tree? Why would you use it? 2012-12-23T23:30:46.947

17 Getting parent of a vertex in a perfect binary tree 2013-12-05T16:27:44.500

16 Looking for fast algorithm to find distance between two nodes in binary tree 2010-01-25T18:29:00.043

16 Nth largest element in a binary search tree 2010-04-10T05:24:29.890

16 How to calculate pointers in a binary tree with the van Emde Boas layout 2011-02-05T15:31:23.190

16 How does a red-black tree work? 2011-04-28T04:30:00.790

16 Enforcing horizontal node ordering in a .dot tree 2012-06-05T18:25:28.370

15 Postorder Traversal 2010-07-09T20:11:58.213

15 how is the complexity of Morris Traversal o(n)? 2011-06-25T13:36:55.890

15 How to find largest common sub-tree in the given two binary search trees? 2011-07-13T04:11:11.887

15 Nicely printing/showing a binary tree in Haskell 2012-09-23T21:34:28.557

15 Why do we need a separate datastructure like B-Tree for database and file system? 2012-10-10T12:11:28.820

15 print all root to leaf paths in a binary tree 2013-02-18T12:54:42.183

15 Traversing through all nodes of a binary tree in Java 2013-03-09T02:22:47.100

15 print level order traversal of binary tree in Zigzag manner 2013-07-05T09:42:06.370

14 Balancing a Binary Tree (AVL) 2008-09-25T14:18:19.327

14 Finding last element of a binary heap 2009-02-01T02:42:38.787

14 compare Hash with Binary search tree 2009-10-13T09:37:54.907

14 Persistent (purely functional) Red-Black trees on disk performance 2010-05-05T02:07:39.497

14 Sort BST in O(n) using constant memory 2010-07-01T13:00:57.630

14 Sorting the elements in Binary trees 2013-03-29T02:44:06.660

14 Number of binary search trees over n distinct elements 2013-04-14T21:45:57.063

14 C# Display a Binary Search Tree in Console 2016-03-30T14:32:49.533

13 Search times for binary search tree 2009-02-08T23:59:58.793

13 How to convert a binary tree to binary search tree in-place, i.e., we cannot use any extra space 2010-04-05T05:46:59.683

13 For a given binary tree find maximum binary search sub-tree 2010-07-02T05:15:08.420

13 Tutorial for Tree Data Structure in C 2010-07-22T02:16:49.740

13 Priority Queue with a find function - Fastest Implementation 2010-10-20T02:24:04.833

13 Lowest Common Ancestor of a Binary Tree 2011-04-04T04:01:48.313

13 Using arrow -> and dot . operators together in C 2011-04-30T22:15:01.017

13 Diameter of Binary Tree - Better Design 2012-08-10T07:18:38.983

13 How to construct BST given post-order traversal 2012-10-31T21:15:03.860

13 Is it possible to lazily traverse a recursive data-structure with O(1) memory usage, tail-call optimized? 2013-08-20T22:06:01.637

13 Constructing a Binary tree in Java 2013-12-22T17:08:28.230

13 Can max/min heap trees contain duplicate values? 2014-03-21T21:47:50.107