tree traverse
Смотреть что такое "tree traverse" в других словарях:
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
traverse — 1. noun /ˈtɹəˌvə(ɹ)s/ a) A route used in mountaineering, specifically rock climbing, in which the descent occurs by a different route than the ascent. b) In fortification, a mass of … Wiktionary
Tree climbing — Grimpe d arbres La grimpe d arbres (ou grimpe encadrée dans les arbres) est considérée en France comme le terme générique définissant le loisir éducatif qui consiste à grimper jusqu aux cimes et à se déplacer dans les houppiers des arbres en… … Wikipédia en Français
traverse — v 1. pass over, move over, travel over, tour, fare; range, ply, wander, roam, track; cover, sweep, peregrinate; tramp, trek, ramble, march, walk; sail, voyage, cruise, navigate, make a passage; ford, cross, overpass, cut across. 2. cross, go… … A Note on the Style of the synonym finder
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
Interval tree — In computer science, an interval tree, also called a segment tree or segtree, is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is… … Wikipedia
Cherry Tree Inn and Suites — (Traverse City,США) Категория отеля: 3 звездочный отель Адрес: 2345 Highw … Каталог отелей
Spanning tree protocol — The Spanning Tree Protocol is an OSI layer 2 protocol that ensures a loop free topology for any bridged LAN. It is based on an algorithm invented by Radia Perlman while working for Digital Equipment Corporationcite… … Wikipedia
Spanning Tree Protocol — Internet protocol suite Application layer BGP DHCP DNS FTP HTTP … Wikipedia
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
Hilbert R-tree — Hilbert R tree, an R tree variant, is an index for multidimensional objects like lines, regions, 3 D objects, or high dimensional feature based parametric objects. It can be thought of as an extension to B+ tree for multidimensional objects.The… … Wikipedia
