Tag Archives: binary trees

Binary Search Tree – Lowest Common Ancestor – Python

Posted on June 1, 2008 by nolfonzo

The last problem in the Trees chapter of Programming Interviews Exposed was about finding the lowest common ancestor between two nodes of a binary search tree. Starting from the head, if you find that the nodes that you’re looking for … Continue reading →

Posted in programming | Tagged , , , | 2 Comments

Tree Traversal – Python

Posted on May 31, 2008 by nolfonzo

Another question posed in the Programming Interviews Exposed book. A pre-ordered traversal of a binary tree (counterclockwise starting at root, printing nodes as you encounter them) is pretty straight forward, and a very natural thing to implement with recursion: A … Continue reading →

Posted in programming | Tagged , , , | 4 Comments