Returns the right node of a given node
.
The index of the right node of a specified node
is calculated as being:
/////////////////////////////////////////////////////////////////////////// // Copyright (C) 2013 Wizardry and Steamworks - License: GNU GPLv3 // /////////////////////////////////////////////////////////////////////////// string wasBinaryTreeRight(list BT, string node) { // Right child index: 2*i + 2 integer i = llListFindList(BT, (list)node); if(i == -1) return ""; return llList2String(BT, 2*i+2); }