Binary Search Tree (BST) implementation in C++
Categories
Tag Archives: tree
(C++) [CISP 430] Binary Search Tree
Posted in C++ Also tagged algorithm, binary search tree, binary tree, BST, c++, development, programming Leave a comment
Binary Search Trees (BSTs) in C#
A Binary Search Tree (also known as a BST) is a data structure that contains ordered nodes. Each node contains an element, a left node and a right node. The nodes on the left are all nodes that contain values lower than the element and the nodes on the right contain values higher than the [...]
Posted in C# Also tagged binary search tree, binary tree, BST, c#, c-sharp, data structure, element, generics, leaf, log n, logarithmic time, node, programming, root node Leave a comment
XPath queries in PHP
XPath is a query language for selecting XML nodes. Suppose that you have a collection of companies represented in an XML document.
Posted in PHP Also tagged dom, expression, node, php, programming, query, query language, xml, xpath Leave a comment
Parsing XML in C#
This example parses an XML file with a collection of books into a DOM tree using a console application.
Posted in C# Also tagged c#, c-sharp, console application, dom, parse xml, programming, xml, xml tree Leave a comment
Parsing XML in Java
There are several methods available for parsing an XML file. Some parsers transform the XML file into a traversable DOM tree. The tree consists of a root node and one or more child nodes belonging to the root node. These child nodes are able have child nodes of their own and so forth. Nodes without children [...]
Posted in Java Also tagged development, dom, event handler, java, parser, programming, sax, xml Leave a comment