A tree data structure in which each node has at most two child nodes.
I recently came across the data structure known as a skip list. It seems to have very similar behavior to …
algorithm language-agnostic data-structures binary-tree skip-listsHow can I write a Java iterator (i.e. needs the next and hasNext methods) that takes the root of …
java algorithm iterator binary-tree nodesI realized recently that while having used BST's plenty in my life, I've never even contemplated using anything but Inorder …
data-structures computer-science binary-tree preorderI was looking at interview questions and I recently came upon one that asked you how to reverse a general …
java data-structures tree binary-tree reverseHow to find the Nth largest node in a BST? Do I keep a count variable while doing In Order …
algorithm binary-treeToday I had an interview where I was asked to write a program which takes a Binary Tree and returns …
algorithm binary-tree binary-search-treeThis is an interview question I think of a solution. It uses queue. public Void BFS() { Queue q = new Queue(); …
algorithm binary-tree breadth-first-searchI have the following text from an academic course I took a while ago about inorder traversal (they also call …
data-structures binary-tree tree-traversalDo you know, please, if C++ STL contains a Binary Search Tree (BST) implementation, or if I should construct my …
c++ binary-tree binary-searchTo begin with, this question is not a dup of this one, but builds on it. Taking the tree in …
python algorithm binary-tree breadth-first-search tree-traversal